Meta-RaPS with Q Learning Approach Intensified by Path Relinking for the 0-1 Multidimensional Knapsack Problem
نویسندگان
چکیده
Many successful metaheuristics employ intelligent procedures to obtain high quality solutions for optimization problems. Intelligence emerges in these metaheuristics via memory and learning. Meta-RaPS (Metaheuristic for Randomized Priority Search) which can produce promising solutions is classified as a memoryless metaheuristic. To improve its performance, Q learning and Path Relinking (PR) are selected as memory and learning mechanisms to be incorporated into Meta-RaPS. In the proposed algorithm, Meta-RaPS Q-PR, Q learning and PR approaches serve as mechanisms that learn the best policy to construct a solution, and learn “good” attributes of best solutions to reach the optimum solution while losing “bad” attributes of the current solution. The 0-1 multidimensional knapsack problem will be used to evaluate the Meta-RaPS Q-PR.
منابع مشابه
Using The Meta-Raps Approach To Solve Combinatorial Problems
This paper introduces an interesting meta-heuristic called Meta-RaPS (Meta-heuristic for Randomized Priority Search) for solving combinatorial problems . Meta-RaPS incorporates randomness within priority rules to construct a feasible solution at each iteration. In addition, Meta-RaPS includes improvement heuristics for enhancing the feasible solution already obtained. Applications discussed inc...
متن کاملMemory and Learning in Metaheuristics
The rapid increase of dimensions and complexity of real life problems makes it more difficult to find optimal solutions by traditional optimization methods. This challenge requires intelligent and sophisticated algorithms to make the right decisions given a set of inputs and a variety of possible actions. In the problem solving arena, this definition is transformed into the term of artificial i...
متن کاملAn evolutionary path relinking approach for the quadratic multiple knapsack problem
The quadratic multiple knapsack problem (QMKP) is a challenging combinatorial optimization problem with numerous applications. In this paper, we propose the first evolutionary path relinking approach (EPR) for solving the QMKP approximately. This approach combines advanced features both from the path relinking (PR) method and the responsive threshold search algorithm. Thanks to the tunneling pr...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملA Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we propose a new parallel meta heuristic algorithm based on the Tabu Search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynam...
متن کامل